A structured argumentation framework for detaching conditional obligations

We present a general formal argumentation system for dealing with the detachment of conditional obligations. Given a set of facts, constraints, and conditional obligations, we answer the question whether an unconditional obligation is detachable by considering reasons for and against its detachment. For the evaluation of arguments in favor of detaching obligations we use a Dung-style argumentation-theoretical semantics. We illustrate the modularity of the general framework by considering some extensions, and we compare the framework to some related approaches from the literature.Comment: This is our submission to DEON 2016, including the technical appendi

Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling.Comment: Minor changes and updates to reference

Reasoning by Cases in Structured Argumentation

We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `$A$ or $B$', an argument based on $A$ with conclusion $C$, and an argument based on $B$ with conclusion $C$, we allow the construction of an argument with conclusion $C$. We show how our framework leads to different results than other approaches in non-monotonic logic for dealing with disjunctive information, such as disjunctive default theory or approaches based on the OR-rule (which allows to derive a defeasible rule `If ($A$ or $B$) then $C$', given two defeasible rules `If $A$ then $C$' and `If $B$ then $C$'). We raise new questions regarding the subtleties of reasoning defeasibly with disjunctive information, and show that its formalization is more intricate than one would presume.Comment: Proceedings of SAC/KRR 201

Existence of Atoms and Molecules in the Mean-Field Approximation of No-Photon Quantum Electrodynamics

The Bogoliubov-Dirac-Fock (BDF) model is the mean-field approximation of no-photon Quantum Electrodynamics. The present paper is devoted to the study of the minimization of the BDF energy functional under a charge constraint. An associated minimizer, if it exists, will usually represent the ground state of a system of $N$ electrons interacting with the Dirac sea, in an external electrostatic field generated by one or several fixed nuclei. We prove that such a minimizer exists when a binding (HVZ-type) condition holds. We also derive, study and interpret the equation satisfied by such a minimizer. Finally, we provide two regimes in which the binding condition is fulfilled, obtaining the existence of a minimizer in these cases. The first is the weak coupling regime for which the coupling constant $\alpha$ is small whereas $\alpha Z$ and the particle number $N$ are fixed. The second is the non-relativistic regime in which the speed of light tends to infinity (or equivalently $\alpha$ tends to zero) and $Z$, $N$ are fixed. We also prove that the electronic solution converges in the non-relativistic limit towards a Hartree-Fock ground state.Comment: Final version, to appear in Arch. Rat. Mech. Ana

The Thermodynamic Limit of Quantum Coulomb Systems: A New Approach

We present two recent works on the thermodynamic limit of quantum Coulomb systems, in which we provided a general method allowing to show the existence of the limit for many different models.Comment: Talk given by M.L. at QMath10, 10th Quantum Mathematics International Conference, Moeciu (Romania) in September 200

Estimating the efficient price from the order flow: a Brownian Cox process approach

At the ultra high frequency level, the notion of price of an asset is very ambiguous. Indeed, many different prices can be defined (last traded price, best bid price, mid price,...). Thus, in practice, market participants face the problem of choosing a price when implementing their strategies. In this work, we propose a notion of efficient price which seems relevant in practice. Furthermore, we provide a statistical methodology enabling to estimate this price form the order flow

How memory generates heterogeneous dynamics in temporal networks

Empirical temporal networks display strong heterogeneities in their dynamics, which profoundly affect processes taking place on these networks, such as rumor and epidemic spreading. Despite the recent wealth of data on temporal networks, little work has been devoted to the understanding of how such heterogeneities can emerge from microscopic mechanisms at the level of nodes and links. Here we show that long-term memory effects are present in the creation and disappearance of links in empirical networks. We thus consider a simple generative modeling framework for temporal networks able to incorporate these memory mechanisms. This allows us to study separately the role of each of these mechanisms in the emergence of heterogeneous network dynamics. In particular, we show analytically and numerically how heterogeneous distributions of contact durations, of inter-contact durations and of numbers of contacts per link emerge. We also study the individual effect of heterogeneities on dynamical processes, such as the paradigmatic Susceptible-Infected epidemic spreading model. Our results confirm in particular the crucial role of the distributions of inter-contact durations and of the numbers of contacts per link